Coloring based Hierarchical Routing Approach
نویسندگان
چکیده
منابع مشابه
Coloring based Hierarchical Routing Approach
Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, we propose to jointly use coloring for routing purposes. We introduce CHRA a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences and also to schedule nodes transmissions to sink. We provid...
متن کاملIntelligent Hierarchical Cluster - Based Routing
We propose an energy-efficient hierarchical cluster-based routing (HCR) protocol where nodes self-organize into clusters and each cluster is managed by a set of associates called head-set. Using round-robin technique, each head-set member acts a cluster head (CH). The sensor nodes transmit data to their cluster heads, which transmit the aggregated data to the base station. Moreover, the energy-...
متن کاملSequence Based Hierarchical Conflict-free Routing Strategy
Conflict-free routing is an important problem to be addressed in AGV Systems, in particular when they are bi-directional. This paper considers the problem of routing AGVs in the presence of contingencies. The importance of this work stems from the realization that path-planning approaches are ill suited to AGVSs subject to contingencies. In this paper, a two stage closed-loop control strategy i...
متن کاملLoad-based Clustering for Hierarchical Routing
A novel abstraction of the available bandwidth in a communication network is presented based on the blocking island abstraction (Frei & Faltings 1997). Path computing algorithms using this abstraction are presented for non-hierarchical and hierarchical networks. For the latter case, a composeable abstraction of subnetworks is proposed.
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2013
ISSN: 1877-0509
DOI: 10.1016/j.procs.2013.06.029